Probabilistic ODE Solvers with Runge-Kutta Means

نویسندگان

  • Michael Schober
  • David K. Duvenaud
  • Philipp Hennig
چکیده

Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of probabilistic numerical methods that instead return a Gauss-Markov process defining a probability distribution over the ODE solution. In contrast to prior work, we construct this family such that posterior means match the outputs of the Runge-Kutta family exactly, thus inheriting their proven good properties. Remaining degrees of freedom not identified by the match to Runge-Kutta are chosen such that the posterior probability measure fits the observed structure of the ODE. Our results shed light on the structure of Runge-Kutta solvers from a new direction, provide a richer, probabilistic output, have low computational cost, and raise new research questions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Instance of Failure for the MATLAB Explicit ODE45 Solver

We consider the adaptive strategies applicable to a simple model describing the phase lock of two coupled oscillators. This model has been used to show an instance of failure of the ODE45 RungeKutta-Felberg solver implemented within the MATLAB ODE suite, see [J. D. Skufca. Analysis still matters: a surprising instance of failure of Runge-KuttaFelberg ODE solvers. SIAM Review, 46:729-737, 2004]....

متن کامل

Analysis Still Matters: A Surprising Instance of Failure of Runge-Kutta-Felberg ODE Solvers

This paper provides a nice example to illustrate that without supporting analysis, a numerical simulation may lead to incorrect conclusions. We explore a pedagogical example of failure of Runge–Kutta–Felberg (RKF) algorithms for a simple dynamical system that models the coupling of two oscillators. Although the system appears to be well-behaved, the explicit RKF solvers provide erratic numerica...

متن کامل

Probabilistic Linear Multistep Methods

We present a derivation and theoretical investigation of the Adams-Bashforth and Adams-Moulton family of linear multistep methods for solving ordinary differential equations, starting from a Gaussian process (GP) framework. In the limit, this formulation coincides with the classical deterministic methods, which have been used as higher-order initial value problem solvers for over a century. Fur...

متن کامل

Active Uncertainty Calibration in Bayesian ODE Solvers

There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al. introduced a sampling-based class of methods that are ‘well-calibrated’ in a specific sense. But the computational cost of these methods is significantly above that of classic methods. On the o...

متن کامل

Simple ODE Solvers - Error Behaviour

y(t0) = y0 Here f(t, y) is a given function, t0 is a given initial time and y0 is a given initial value for y. The unknown in the problem is the function y(t). Two obvious considerations in deciding whether or not a given algorithm is of any practical value are (a) the amount of computational effort required to execute the algorithm and (b) the accuracy that this computational effort yields. Fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014